Quadratic Embedding Constants of Graph Joins
نویسندگان
چکیده
The quadratic embedding constant (QE constant) of a graph is new characteristic value defined through the distance matrix. We derive formulae for QE constants join two regular graphs, double graphs and certain lexicographic product graphs. Examples include complete bipartite wheel friendship completely split graph, some associated to strongly
منابع مشابه
Embedding Similarity Joins into Native XML Databases
Similarity joins in databases can be used for several important tasks such as data cleaning and instance-based data integration. In this paper, we explore ways how to support such tasks in a native XML database environment. The main goals of our work are: a) to prove the feasibility of performing tree similarity joins in a general-purpose XML database management system; b) to support stringand ...
متن کاملQuadratic Surface Embedding
We discuss various primal and dual algorithms for multidimensional scaling with spherical, ellipsoidal, and more general quadratic constraints. Distances between points on the surface can be either measured along Euclidean lines or along shortest geodesics on the surface.
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولGraph Embedding
Some of the parameters used to analyze the efficiency of an embedding are dilation, expansion, edge congestion and wirelength. If e = (u, v) ∈E (G), then the length of Pf (e) in H is called the dilation of the edge e. The maximal dilation over all edges of G is called the dilation of the embedding f. The dilation of embedding G into H is the minimum dilation taken over all embeddings f of G int...
متن کاملRigidity of Graph Joins and Hendrickson's Conjecture
Whiteley [9] gives a complete characterization of the infinitesimal flexes of complete bipartite frameworks. Our work generalizes a specific infinitesimal flex to include joined graphs, a family of graphs that contain the complete bipartite graphs. We use this characterization to identify new families of counterexamples, including infinite families, in R and above to Hendrickson’s conjecture on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2022
ISSN: ['1435-5914', '0911-0119']
DOI: https://doi.org/10.1007/s00373-022-02569-w